Weak survival for branching random walks on graphs
نویسنده
چکیده
We study weak and strong survival for branching random walks on multigraphs. We prove that, for a large class of multigraphs, weak survival is related to a geometrical parameter of the multigraph and that the existence of a pure weak phase is equivalent to nonamenability. Finally we study weak and strong critical behaviors of the branching random walk.
منابع مشابه
Characterization of the Critical Values of Branching Random Walks on Weighted Graphs through Infinite-type Branching Processes
We study the branching random walk on weighted graphs; site-breeding and edgebreeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We characterize the weak critical value and relate it to another geometrical parameter. We prove that, at the strong critical value, the process dies out locall...
متن کاملCritical behaviors and critical values of branching random walks on multigraphs
We consider weak and strong survival for branching random walks on multigraphs with bounded degree. We prove that, at the strong critical value, the process dies out locally almost surely. We relate the weak critical value to a geometrical parameter of the multigraph. For a large class of multigraphs (which enlarges the class of quasi-transitive or regular graphs) we prove that, at the weak cri...
متن کاملBranching random walks and contact processes on Galton-Watson trees
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is a Galton-Watson tree then, in certain circumstances, the branching random walks and contact processes will have weak survival phases. We also provide bounds...
متن کاملCharacterization of Critical Values of Branching Random Walks on Weighted Graphs through Infinite-type Branching Processes
We study the branching random walk on weighted graphs; site-breeding and edgebreeding branching random walks on graphs are seen as particular cases. Two kinds of survival can be identified: a weak survival (with positive probability there is at least one particle alive somewhere at any time) and a strong survival (with positive probability the colony survives by returning infinitely often to a ...
متن کاملBranching random walks in random environment on Cayley graphs
We review some recent results concerning recurrence and transience for branching random walks in random environment on ddimensional lattices and on trees. We obtain some generalizations of these results for the case when the branching random walk in random environment takes place on arbitrary infinite connected Cayley graph.
متن کامل